Annotation and matching of first-class agent interaction protocols

نویسندگان

  • Tim Miller
  • Peter McBurney
چکیده

Many practitioners view agent interaction protocols as rigid specifications that are defined a priori, and hard-code their agents with a set of protocols known at design time — an unnecessary restriction for intelligent and adaptive agents. To achieve the full potential of multi-agent systems, we believe that it is important that multi-agent interaction protocols are treated as first-class computational entities in systems. That is, they exist at runtime in systems as entities that can be referenced, inspected, composed, invoked and shared, rather than as abstractions that emerge from the behaviour of the participants. Using first-class protocols, a goal-directed agent can assess a library of protocols at runtime to determine which protocols best achieve a particular goal. In this paper, we present three methods for annotating protocols with their outcomes, and matching protocols using these annotations so that an agent can quickly and correctly find the protocols in its library that achieve a given goal, and discuss the advantages and disadvantages of each of these methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Executable Logic for Reasoning and Annotation of First-Class Agent Interaction Protocols

Interaction protocols are seen a promising approach to coordination in multi-agent systems. However, many practitioners view agent interaction protocols as rigid specifications that are defined a priori, and hard-coded their agents with a set of protocols known at design time — a restriction that is out of place with the goals of agents being intelligent and adaptive. To achieve the full potent...

متن کامل

Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols

Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in order to decide which path an interaction will take. This leads to several problems, three of which are particularly notable: hard-coding the decisions about interaction within an agent strongly couples the agent and the protocol...

متن کامل

Amongst First-Class Protocols

The ubiquity of our increasingly distributed and complex computing environments have necessitated the development of programming approaches and paradigms that can automatically manage the numerous tasks and processes involved. Hence, research into agency and multi-agent systems are of more and more interest as an automation solution. Coordination becomes a central issue in these environments. T...

متن کامل

Characterising and matching iterative and recursive agent interaction protocols

For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is executed. In some cases, this information may be attached to the specification; however, this is not always the case. In this paper, we present an algorithm for deriving characterisations of protocols. These characterisa...

متن کامل

I-36: Updates on Matching IVF Protocols with Patient Segments

Background - MaterialsAndMethods N;Results N;Conclusion N;

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008